Public key cryptosystem MST3: cryptanalysis and realization

نویسندگان

  • Pavol Svaba
  • Tran van Trung
چکیده

A new type of public key cryptosystem, called MST3, has been recently introduced on the basis of covers and logarithmic signatures for non-abelian finite groups. The class of Suzuki 2-groups has been proposed for a possible realization of the generic scheme. Due to their simple structure, the groups enable us to study the security of the system and also provide an efficient implementation. An earlier relevant result of the cryptanalysis has shown that the transversal logarithmic signatures are unfit for use in this realization. In this paper we present a revised version of MST3 for the Suzuki 2groups and show a thorough study of its security. Using heuristic and algebraic methods we establish strong lower bounds for the workload of conceivable direct attacks on the private key of the scheme. We then develop a powerful chosen plaintext attack which allows us to rule out the usage of a certain class of logarithmic signatures. In addition, we show a class of logarithmic signatures withstanding this attack and thus to our knowledge they could be used in the realization of the scheme. Finally, we describe and discuss the implementation issues of the scheme in detail and include data of its performance obtained from an experimental result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Security of a Realization of Cryptosystem Mst3

A new type of public key cryptosystem, called MST3, has been recently developed on the basis of logarithmic signatures and covers of finite groups. The Suzuki 2-groups have been suggested for a possible realization of the generic version of MST3. On one hand, due to their structure, the Suzuki 2-groups allow one to study the security complexity of the system, on the other hand they possess a si...

متن کامل

On public-key cryptosystem MST3 and its realization

8th Central European Conference on Cryptography 2008 1 versions. Finally, we discuss the choice of suitable parameters for an efficient realization of thesystem and its practical usage.References [1] S. S. Magliveras, D. R. Stinson and Tran van Trung, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, J. Cryptology, 15 (2002), 28...

متن کامل

Some Results in Group-Based Cryptography

Group-based cryptography is concerned with the role of nonabelian groups in cryptography. Since its origins in the 1980s, there have been numerous cryptographic proposals based on nonabelian groups, many of which have been broken. This thesis adds to the cryptanalytic literature by demonstrating the insecurity of several group-based cryptosystems. We cryptanalyse several key establishment proto...

متن کامل

Strongly aperiodic logarithmic signatures

Logarithmic signatures for finite groups are the essential constituent of public key cryptosystems MST1 and MST3. Especially they form the main component of the private key of MST3. Constructing new classes of logarithmic signatures having features that do not share with the well-known class of transversal or fused transversal logarithmic signatures, has become a vital issue regarding the use o...

متن کامل

Cryptanalysis of a Public Key Cryptosystem Based on the Matrix Combinatorial Problem

In this paper, we present a cryptanalysis of a public key cryptosystem based on the matrix combinatorial problem proposed by Wang and Hu (2010). Using lattice-based methods finding small integer solutions of modular linear equations, we recover the secret key of this cryptosystem for a certain range of parameters. In experiments, for the suggested parameters by Wang and Hu, the secret key can b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Mathematical Cryptology

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2010